Second Order Strong F-Pseudoconvexity in a Class of Non-Differentiable Scalar Nonlinear Programming Problems
نویسنده
چکیده
A new class of functions namely, second order strongly F-pseudoconvex functions is introduced which is a generalization of both strongly pseudoconvex functions and strongly pseudoinvex functions. Second order optimality conditions and second order duality results for a class of nonlinear non-differentiable scalar programming problems with a square root term in the objective function as well as in the constraints are obtained under the assumptions of second order F-pseudoconvexity and second order strong Fpseudoconvextiy on the functions involved.
منابع مشابه
Non-differentiable second order symmetric duality in mathematical programming with F-convexity
A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.
متن کاملSecond Order Mixed Symmetric Duality in Non-differentiable Multi-objective Mathematical Programming
A pair of Mond-Weir type second order mixed symmetric duals is presented for a class of non-differentiable multi-objective nonlinear programming problems with multiple arguments. We establish duality theorems for the new pair of dual models under second order generalized convexity assumptions. This mixed second order dual formulation unifies the two existing second order symmetric dual formulat...
متن کاملMixed symmetric duality in non-differentiable multiobjective mathematical programming
Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...
متن کاملRegularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz. Necessary optimality conditions and regularity conditions are given. Our approach are based on the Michel-Penot subdifferential.
متن کاملNon-differentiable multiobjective mixed symmetric duality under generalized convexity
* Correspondence: lijueyou@163. com Department of Mathematics, Chongqing Normal University, Chongqing, 400047, PR China Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems...
متن کامل